Ranks of Nets

نویسنده

  • G. Eric Moorhouse
چکیده

Let N be a k-net of prime order p. We find bounds on the p-rank of (the point-line incidence matrix of) N for k ∈ {3, 4}, and observe connections between the p-rank and certain structural properties of N . Implications for the study of finite projective planes are described. 1. Loops and 3-Nets of Prime Order Let (L, ∗) be a loop of prime order p. The 3-net N = N (L) coordinatized by L is the point-line incidence system having p points L = L× L, and 3p lines given by {a} × L for a ∈ L (the lines “x = a”); L× {b} for b ∈ L (the lines “y = b”); and {(x, y) ∈ L : x ∗ y = c} for c ∈ L (the lines “x ∗ y = c”). The point-line incidence matrix of N is the p2×3p matrix with rows and columns indexed by points and lines of N respectively; and having entries 0 and 1 corresponding to nonincident and incident point-line pairs respectively. We have 1.1 Main Theorem [5]. The p-rank of the incidence matrix of N equals 3p−3 if L is associative, and 3p−2 otherwise. Our original proof [5], still the simplest proof available, uses loop theory. (Here for simplicity we consider only loops and nets of prime order, although more arbitrary finite orders were considered in [5].) We reproduce this proof below; and we indicate three alternative proofs of the same result. Our (currently unrealized) goal is a generalization of Theorem 1.1 to k-nets for k = 3, 4, . . . , p+1; possibly using techniques from nonassociative algebra, or possibly by generalizing some of the other techniques described in this paper. The desired generalization of this result is 1.2 Conjecture [5]. Let N be any k-net of prime order p, and let N ′ be any (k−1)-subnet ofN obtained by deleting one of the k parallel classes of lines ofN ; here k ∈ {2, 3, . . . , p+1}. Then the p-rank of the incidence matrix of N exceeds that of N ′ by at least p−k+1. The significance of Conjecture 1.2 lies in the fact [5] that this would imply that every projective plane of prime order is Desarguesian, thereby settling one of the most celebrated currently open problems in finite geometry. Extensions of this method to other finite orders would yield restrictions on the possible orders of finite projective planes, beyond the restrictions available through the Bruck-Ryser Theorem [2]. We believe that these finite geometric questions are worthy of the attention of researchers in nonassociative algebra. Indeed, Belousov [1] attributes the origins of quasigroup theory to the study of

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Codes of Bruck Nets and Projective Planes

We summarize some recent results concerning codes of finite nets, which are of interest in the search for non-Desarguesian planes of prime order and certain composite orders. The p-ranks of 3-nets are determined by algebraic properties of the defining loops, and p-ranks of k-nets admitting certain abelian groups of translations are bounded by algebraic properties of the groups. Here we discuss ...

متن کامل

A Conceptual Complexity Metric Based on Representational Rank

A conceptual complexity metric based on representational rank is proposed. Rank is the number of entities that are bound into a representation, and is related to the number of dimensions, which is a measure of complexity. Each rank corresponds to a class of neural nets. The ranks and typical concepts which belong to them, are: Rank 0, elemental association; Rank 1, content-specific representati...

متن کامل

Wadge Degrees of $\omega$-Languages of Petri Nets

We prove that ω-languages of (non-deterministic) Petri nets and ω-languages of (non-deterministic) Turing machines have the same topological complexity: the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Petri nets are equal to the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Turing machines which also form the class of effective...

متن کامل

یافته علمی کوتاه: کارآیی تور گوشگیر ثابت با چشمه 170 میلیمتر در کاهش میزان صید ماهیان نارس تاسماهی ایرانی (Acipenser persicus)

This study was carried out in Turkmen fishing station to examine suitable mesh size of gill nets for Persian sturgeon, Acipenser persicus, to decrease possibility of catching immature specimens and increase catch likelihood for larger fish. The Holt model was used to determine suitable length for catch and selection of mature Persian sturgeon females. Following preliminary studies some 920 expe...

متن کامل

On Fast Deep Nets for AGI Vision

Artificial General Intelligence will not be general without computer vision. Biologically inspired adaptive vision models have started to outperform traditional pre-programmed methods: our fast deep / recurrent neural networks recently collected a string of 1st ranks in many important visual pattern recognition benchmarks: IJCNN traffic sign competition, NORB, CIFAR10, MNIST, three ICDAR handwr...

متن کامل

Frequency of illegal abandoned gillnets in the coastal waters of Golestan Province

Gillnets are sometimes abandoned or lost at sea due to sea storms, tearing by a hard object, or the failure of fishermen to find the fishing area. In this study, the data related to the frequency of illegal abandoned fishing nets in Golestan province were collected through field patrols and questionnaire information from spring to winter 2016. 88,465 abandoned fishing nets were collected in the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006